Computer network rumours prove hard to kill
نویسندگان
چکیده
منابع مشابه
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
In this note we rst formalize the notion of hard tautologies using a nondeterministic generalization of instance complexity. We then show, under reasonable complexity-theoretic assumptions, that there are innnitely many propositional tautologies that are hard to prove in any sound propositional proof system.
متن کاملWhy Are Bad Products So Hard to Kill?
I is puzzling that firms often continue to invest in product development projects when they should know that demand will be low. We argue that bad products are hard to kill because firms face an inherent conflict when designing managers’ incentives. Rewarding success encourages managers to forge ahead even when demand is low. To avoid investing in low-demand products, the firm must also reward ...
متن کاملComputer-Aided Way to Prove Theorems in Scheduling
Аннотация For two scheduling problems (O3||Cmax and AL3||Cmax) tight bounds of the optima localization intervals are found in terms of lower bounds (C̃ and Ĉ, respectively) computable in linear time. The main part of the proof was made with an aid of computer. As a by-product, we obtain linear-time approximation algorithms for solving these problems with worst-case performance ratios 4/3 and 5/3...
متن کاملLearning to Prove in Order to Prove to Learn
Proving is a basic skill for mathematicians; however, this is a difficult skill for some students to learn. In fact, traditionally students have struggled with learning to prove in their junior level mathematics courses. Recently, many universities have instituted a transition course to help students make the transition from computational courses to more proof based courses. This paper is a sur...
متن کاملPolynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion
A number of results in hamiltonian graph theory are of the form P1 implies P2, where P1 is a property of graphs that is NP-hard and P2 is a cycle structure property of graphs that is also NP-hard. Such a theorem is the well-known Chvátal-Erdös Theorem, which states that every graph G with α ≤ κ is hamiltonian. Here κ is the vertex connectivity of G and α is the cardinality of a largest set of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1992
ISSN: 0028-0836,1476-4687
DOI: 10.1038/357528a0